Formulation of commons dilemma: Dawes model reconsidered

This paper examines Dawes (1975) model on commons dilemma (CD) situation and proposes an alternative model which formulates CD. Firstly, it makes clear that Dawes model does not have the characteristics of CD. Secondly, it specifies “resource unit condition” which models of commons dilemma must satisfy. Thirdly, it presents CD model, which is obtained by setting the condition in Dawes model. And lastly, it examines some nature of the proposed model and find that in CD situation, fine is distributed proportionally to each player's property.     

How Fast Is the Bandit?

Abstract

In this article we investigate the rate of convergence of the so-called two-armed bandit algorithm. The behavior of the algorithm turns out to be highly non standard: no central limit theorem, possible occurrence of two different rates of convergence with positive probability.     

Economic Characterization of Reciprocal Isoperimetric Control Problems Revisited

Theorem 2.1 of Caputo (Ref. 1) linking the optimal solution functions and optimal value functions of reciprocal pairs of isoperimetric control problems is correct, but requires stronger assumptions than those used explicitly to establish its veracity. One such set of stronger assumptions is provided in this note.     

MANAGEMENT OF A RENEWABLE RESOURCE WITH A FINITE DEMAND ELASTICITY

Optimal management policies are derived for a renewable resource when the demand for output has finite elasticity. The analysis modifies traditional views of this problem by allowing for the possibility that static optimizing policies, which maximize myopic net revenues, may be superior to “Golden Rule” policies which account for longer-run stock effects.     

六西格玛管理中的网络计划技术及其应用

利用网络计划技术,对节点(事项)和箭条(作业活动)分别规定了六个时间值,讨论了他们之间的关系;结合实例应用,分析了资源的合理配置,得到了有一定参考意义的结果.     

Multi-objectives Tabu Search based algorithm for progressive resource allocation

Military course of action planning involves time and space synchronization as well as resource and asset allocation. A mission could be seen as a defined set of logical ordered tasks with time and space constraints. The resources to task rules require that available assets should be allocated to each task. A combination of assets might be required to execute a given task. The couple (task, resources) constitutes an action. This problem is formulated as a multi-objectives scheduling and resource allocation problem. Any solution is assessed based on a number of conflicting and heterogeneous objectives. In fact, military planning officers should keep perfecting the plan based on the Commander’s criteria for success. The scheduling problem and resource allocation problem are considered as NP-Hard Problems [A. Guitouni, B. Urli, J.-M. Martel, Course of action planning: A project based modelling, Working Paper, Faculté des sciences de l’ administration, Université Laval, Québec, 2005]. This paper is concerned with the multi-objectives resource allocation problem. Our objective is to find adequate resource allocation for given courses of action schedule. To optimize this problem, this paper investigates non-exact solution methods, like meta-heuristic methods for finding potential efficient solutions. A progressive resource allocation methodology is proposed based on Tabu Search and multi-objectives concepts. This technique explores the search space so as to find a set of potential efficient solutions without aggregating the objectives into a single objective function. It is guided by the principle of maximizing the usage of any resource before considering a replacement resource. Thus, a given resource is allocated to the maximum number of tasks for a given courses of action schedule. A good allocation is a potential efficient solution. These solutions are retained by applying a combination of a dominance rule and a multi-criteria filtering method. The performance of the proposed Pareto-based approach is compared to two aggregation approaches: weighted-sum and the lexicographic techniques. The result shows that a Pareto-based approach is providing better solutions and allowing more flexibility to the decision-maker.     

The gravity p-median model

In this paper we propose a new model for the p-median problem. In the standard p-median problem it is assumed that each demand point is served by the closest facility. In many situations (for example, when demand points are communities of customers and each customer makes his own selection of the facility) demand is divided among the facilities. Each customer selects a facility which is not necessarily the closest one. In the gravity p-median problem it is assumed that customers divide their patronage among the facilities with the probability that a customer patronizes a facility being proportional to the attractiveness of that facility and to a decreasing utility function of the distance to the facility.     

Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting

This paper presents a priority rule-based heuristic for the multi-mode resource-constrained project scheduling problem with the splitting of activities around unavailable resources allowed. All resources considered are renewable and each resource unit may not be available at all times due to resource vacations, which are known in advance. A new concept called moving resource strength is developed to help identify project situations where activity splitting is likely to be beneficial during scheduling. The moving resource strength concept is implemented in priority rule-based heuristics to control activity splitting when scheduling. Multiple comparisons of the performance of combination of activity–mode priority rules used in the heuristics are provided. Computational experiments demonstrate the effectiveness of the heuristic in reducing project makespan, and minimizing activity splitting.     

资源区经济与资源环境承载力与可持续发展研究

承载力理论与可持续发展理论密切相关,是可持续发展理论的一个重要组成部分.本文以系统思想为指导,从理论上分析了经济与环境、资源发展的关系;通过实证分析,对资源区进行了定性和定量的研究.     

Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies

This paper studies the impact of management policies, such as product allocation and campaign sizing, on the required size of the finished goods inventories in a multi-product multi-reactor batch process. Demand, setup and batch processing times for these products are assumed to be stochastic, and the inventory buffer for every product type needs to be such that target customer service levels are met. To perform this analysis, we develop a queueing model that allows us to explicitly estimate service levels as a function of the buffer size, and the allocation/campaign sizing policies. This model can be used to evaluate the service level given an existing buffer configuration, as well as to determine the buffer sizes required across products to meet a pre-specified service level. It also allows us to formulate a number of insights into how product allocation decisions and campaign planning policies affect buffer sizing decisions in symmetric production systems.